M,N -Adhesive Transformation Systems
نویسندگان
چکیده
The categorical framework of M-adhesive transformation systems does not cover graph transformation with relabelling. Rules that relabel nodes are natural for computing with graphs, however, and are commonly used in graph transformation languages. In this paper, we generalise M-adhesive transformation systems to M,N -adhesive transformation systems, where N is a class of morphisms containing the vertical morphisms in double-pushouts. We show that the category of partially labelled graphs is M,N -adhesive, where M and N are the classes of injective and injective, undefinedness-preserving graph morphisms, respectively. We obtain the Local Church-Rosser Theorem and the Parallelism Theorem for graph transformation with relabelling and application conditions as instances of results which we prove at the abstract level of M,N -adhesive systems.
منابع مشابه
Formal Relationship between Petri Net and Graph Transformation Systems based on Functors between M-adhesive Categories
Various kinds of graph transformations and Petri net transformation systems are examples of M -adhesive transformation systems based on M -adhesive categories, generalizing weak adhesive HLR categories. For typed attributed graph transformation systems, the tool environment AGG allows the modeling, the simulation and the analysis of graph transformations. A corresponding tool for Petri net tran...
متن کاملAnalysis of Hypergraph Transformation Systems in AGG based on M-Functors
Hypergraph transformation systems are examples of M -adhesive transformation systems based on M -adhesive categories. For typed attributed graph transformation systems, the tool environment AGG allows the modelling, the simulation and the analysis of graph transformations. A corresponding tool for analysis of hypergraph transformation systems does not exist up to now. The purpose of this paper ...
متن کاملAnalysis of permutation equivalence in -adhesive transformation systems with negative application conditions
M-adhesive categories provide an abstract framework for a large variety of specification frameworks for modelling distributed and concurrent systems. They extend the well-known frameworks of adhesive and weak adhesive HLR categories and integrate high-level constructs like attribution as in the case of typed attributed graphs. This article presents M-adhesive transformation systems including ne...
متن کاملCategorical Frameworks for Graph Transformation and HLR Systems Based on the DPO Approach
Several variants of high-level replacement (HLR) and adhesive categories have been introduced in the literature as categorical frameworks for graph transformation and HLR systems based on the double pushout (DPO) approach. In addition to HLR, adhesive, and adhesive HLR categories several weak variants, especially weak adhesive HLR with horizontal and vertical variants, as well as partial varian...
متن کاملFrom the Lorentz Transformation Group in Pseudo-Euclidean Spaces to Bi-gyrogroups
The Lorentz transformation of order $(m=1,n)$, $ninNb$, is the well-known Lorentz transformation of special relativity theory. It is a transformation of time-space coordinates of the pseudo-Euclidean space $Rb^{m=1,n}$ of one time dimension and $n$ space dimensions ($n=3$ in physical applications). A Lorentz transformation without rotations is called a {it boost}. Commonly, the ...
متن کامل